Quick gossiping by telegraphs

نویسندگان

Roger Labahn

Ingo Warnke

چکیده

We consider gossiping in the complete doubly directed graph, i.e. telegrams arranged in rounds are used to exchange information between n points each having one initial item. It is proved that at least 1:44. .. log 2 n rounds are needed to inform everybody about those n distinct items of information.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gossiping with Bounded Size Messages in ad hoc Radio Networks

We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n)-gossiping. We show that √ n-gossiping in an ad hoc radio network on...

متن کامل

Time and Cost Trade-Offs in Gossiping

Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of efficiency of a gossiping algo...

متن کامل

New bounds on the minimum calls of failure-tolerant gossiping

Gossiping is an extensively investigated information dissemination process. In gossiping, every vertex holds a message which has to be transmitted to all other vertices. This paper deals with k-failure tolerant gossiping, which investigates the minimum number of transmissions (calls) required by the communication process, provided that at most k transmissions may fail. We show new bounds for th...

متن کامل

Anonymous Gossiping

In this paper we introduce a novel gossiping primitive to support privacy preserving data analytics (PPDA). In contrast to existing computational PPDA primitives such as secure multiparty computation and data randomization based approaches, the proposed primitive “anonymous gossiping” is a communication primitive for privacy preserving personalized information aggregation complementing such tra...

متن کامل